Fuzzy Graphs and Fuzzy Hypergraphs

نویسندگان

  • Leonid S. Bershtein
  • Alexander V. Bozhenyuk
چکیده

Graph theory has numerous application to problems in systems analysis, operations research, economics, and transportation. However, in many cases, some aspects of a graph-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to deal with the uncertainty using the methods of fuzzy sets and fuzzy logic. Hypergraphs (Berge,1989) are the generalization of graphs in case of set of multiarity relations. It means the expansion of graph models for the modeling complex systems. In case of modelling systems with fuzzy binary and multiarity relations between objects, transition to fuzzy hypergraphs, which combine advantages both fuzzy and graph models, is more natural. It allows to realise formal optimisation and logical procedures. However, using of the fuzzy graphs and hypergraphs as the models of various systems (social, economic systems, communication networks and others) leads to difficulties. The graph isomorphic transformations are reduced to redefinition of vertices and edges. This redefinition doesn’t change properties the graph determined by an adjacent and an incidence of its vertices and edges. Fuzzy independent set, domination fuzzy set, fuzzy chromatic set are invariants concerning the isomorphism transformations of the fuzzy graphs and fuzzy hypergraph and allow make theirs structural analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS

In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...

متن کامل

Certain networks models using single-valued neutrosophic directed hypergraphs

A directed hypergraph is powerful tool to solve the problems that arises in different fields, including computer networks, social networks and collaboration networks. In this research paper, we apply the concept of single-valued neutrosophic sets to directed hypergraphs. We introduce certain new concepts, including single-valued neutrosophic directed hypergraphs, single-valued neutrosophic line...

متن کامل

Coloring of Intuitionistic Fuzzy Directed Hypergraphs

A hypergraph is a set V of vertices and a set E of non-empty subsets of V , called hyperedges. Unlike graphs, hypergraphs can perform higher-order interactions in social and communication networks. Directed hypergraphs are much like directed graphs. Colors are used to distinguish the classes. Coloring a hypergraph H must assign atleast two different colors to the vertices of every hyperedge. Th...

متن کامل

Properties of Bipolar Fuzzy Hypergraphs

In this article, we apply the concept of bipolar fuzzy sets to hypergraphs and investigate some properties of bipolar fuzzy hypergraphs. We introduce the notion of A− tempered bipolar fuzzy hypergraphs and present some of their properties. We also present application examples of bipolar fuzzy hypergraphs.

متن کامل

Algorithm for Fuzzy Maximum Flow Problem in Hyper-Network Setting

Maximum flow problem on hypergraphs (hyper-networks) is an extension of maximum flow problem on normal graphs. In this paper, we consider a generalized fuzzy version of maximum flow problem in hyper-networks setting. Our algorithm is a class of genetic algorithms and based on genetic tricks. The crisp equivalents of fuzzy chance constraints in hyper-networks setting are defined, and the executi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009